
Ontology%2Dbased knowledge discovery and sharing in bioinformatics and medical informatics A brief survey.

OMIT Domain Ontology and Knowledge Acquisition in MicroRNA Target Prediction %2D %28Short Paper%29.

Ontology%2DBased Mining of Brainwaves A Sequence Similarity Technique for Mapping Alternative Features in Event%2DRelated Potentials %28ERP%29 Data.

Ontograte towards Automatic Integration for Relational Databases and the Semantic Web through an Ontology%2DBased Framework.

Ontology%2Dbased information extraction An introduction and a survey of current approaches.

Using multiple ontologies in information extraction.
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies- which provide formal and explicit specifications of conceptualizations- play a crucial role in the information extraction process. Several OBIE systems have been implemented previously but all of them use a single ontology although multiple ontologies have been designed for many domains. We have studied the theoretical basis for using multiple ontologies in information extraction and have developed information extraction systems that use them. These systems investigate the two major scenarios for having multiple ontologies for the same domain: specializing in subdomains and providing different perspectives. The domain of universities has been used for the former scenario through a corpus collected from university websites. For the latter, the domain of terrorist attacks and a corpus used by a previous Message Understanding Conference (MUC) have been used. The results from these two case studies indicate that using multiple ontologies in information extraction has led to a clear improvement in performance measures.
Using multiple ontologies in information extraction.
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies- which provide formal and explicit specifications of conceptualizations- play a crucial role in the information extraction process. Several OBIE systems have been implemented previously but all of them use a single ontology although multiple ontologies have been designed for many domains. We have studied the theoretical basis for using multiple ontologies in information extraction and have developed information extraction systems that use them. These systems investigate the two major scenarios for having multiple ontologies for the same domain: specializing in subdomains and providing different perspectives. The domain of universities has been used for the former scenario through a corpus collected from university websites. For the latter, the domain of terrorist attacks and a corpus used by a previous Message Understanding Conference (MUC) have been used. The results from these two case studies indicate that using multiple ontologies in information extraction has led to a clear improvement in performance measures.


Ontology Database A New Method for Semantic Modeling and an Application to Brainwave Data.
Abstract. We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for a Semantic Web ontology. In contrast with existing knowledge-based approaches, we expend additional space in the database to reduce reasoning at query time. This implementation significantly improves query response time by allowing the system to disregard integrity constraints and other kinds of inferences at run-time. The surprising result of our approach is that loadtime appears unaffected, even for medium-sized ontologies. We applied our methodology to the study of brain electroencephalographic (EEG and ERP) data. This case study demonstrates how our methodology can be used to proactively drive the design, storage and exchange of knowledge based on EEG/ERP ontologies. 1
A Semi%2DAutomatic Framework for Mining ERP Patterns.
Event-related potentials (ERP) are brain electrophysiological patterns created by averaging electroencephalographic (EEG) data, time-locking to events of interest (e.g., stimulus or response onset). In this paper, we propose a semi-automatic framework for mining ERP data, which includes the following steps: PCA decomposition, extraction of summary metrics, unsupervised learning (clustering) of patterns, and supervised learning, i.e. discovery, of classification rules. Results show good correspondence between rules that emerge from decision tree classifiers and rules that were independently derived by domain experts. In addition, data mining results suggested ways in which expertdefined rules might be refined to improve pattern representation and classification results. 1.
Constructing a User Preference Ontology for Anti%2Dspam Mail Systems.

On Knowledge%2DBased Classification of Abnormal BGP Events.

Development of NeuroElectroMagnetic ontologies%28NEMO%29 a framework for mining brainwave ontologies.

Discovering Executable Semantic Mappings Between Ontologies.
Abstract. Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans (domain experts) for best accuracy, in general, automatic ontology mapping is an AI-Complete problem. Finding matchings (correspondences) between the concepts of two ontologies is the first step towards solving this problem but matchings are normally not directly executable for data exchange or query translation. This paper presents an systematic approach to combining ontology matching, object reconciliation and multi-relational data mining to find the executable mapping rules in a highly automatic manner. Our approach starts from an iterative process to search the matchings and do object reconciliation for the ontologies with data instances. Then the result of this iterative process is used for mining frequent queries. Finally the semantic mapping rules can be generated from the frequent queries. The results show our approach is highly automatic without losing much accuracy compared with human-specified mappings. 1
Clustering Zebrafish Genes Based on Frequent%2DItemsets and Frequency Levels.

Understanding and Utilizing the Hierarchy of Abnormal BGP Events.
Abnormal events, such as security attacks, misconfigurations, or electricity failures, could have severe consequences toward the normal operation of the Border Gateway Protocol (BGP) that is in charge of the delivery of packets between different autonomous domains, a key operation for the Internet to function. Unfortunately, it has been a difficult task for network security researchers and engineers to classify and detect these events. In our previous work, we have shown that with classification (which relies on the labeling with domain knowledge from BGP experts), it is feasible to effectively detect and distinguish some worms and blackouts from normal BGP behaviors. In this paper, we move one important step forward—we show that we can automatically detect and classify between different abnormal BGP events based on a hierarchy discovered by clustering. As a systematic application of data mining, we devise a clustering method based on normalized BGP data that forms a tree-like hierarchy of abnormal BGP event classes. We then obtain a set of classification rules for each class (node) in the hierarchy, thus able to label unknown BGP data to a closest class. Our method works even as the BGP dynamics evolve over time, as shown in our experiments with seven different abnormal events during a four-year period. Our work, in a more general context, shows it is promising to conduct an interdisciplinary research between network security and data mining in solving real-world problems.
Deriving axioms across ontologies.
Ontologies play a key role in agent communication and the emerging Semantic Web. Axioms are an important component of ontologies to describe the relationships among the concepts. The current research on ontology mapping and ontology translation mainly focuses on how to map and translate the vocabularies and associated data instances from one ontology to another. However, when extending one ontology using axioms from another, we must confront the problem of translating axioms. In this paper, we show that simple symbol replacement will not solve the problem of axiom translation because of asymmetry of translation. Instead we extend our inferential ontology translation for facts (ground atomic formulas) and queries to cover axioms using a method we call axiom derivation.
Towards Theory Translation.
Abstract. Ontologies play a key role in agent communication and the emerging Semantic Web to define a vocabulary of concepts and their relationships. Different agents and web services may use vocabularies from different ontologies to describe their data. The current research on ontology mapping and ontology translation mainly focuses on how to map and translate vocabularies and associated data instances from one ontology to another. However, more complicated true statements, such as axioms (rules), are used or being developed to describe the relationships among the concepts. When extending one ontology using complicated true statements (theory) from another, we must confront the problem of theory translation, which is difficult because of the asymmetry of translation. In this paper, using an inferential approach we call axiom derivation, we show how to translate complex axioms between different time ontologies. We also prove the validity of our algorithm. 1
Integrating Databases into the Semantic Web through an Ontology%2DBased Framework.
To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use ontologies to formally define the semantics of their data. Our research in the design and implementation of an ontology-based system, OntoGrate, addresses the critical and challenging problem of supporting human experts in multiple domains to interactively integrate information that is heterogenous in both structure and semantics. Databases, knowledge bases, the World Wide Web, and the emerging Semantic Web are some of the resources for which scalable integration remains a challenge. To integrate databases into the Semantic Web, we use Semantic Web ontologies to incorporate database schemas. An expressive first order ontology language, Web-PDDL, is used to define the structure, semantics, and mappings of data resources. A powerful inference engine, OntoEngine, can be used for query answering and data translation. In this paper, besides introducing new ideas in the OntoGrate system, we will elaborate on two case studies for which our system works well. 1
Ontology%2Dbased integration for relational databases.

Ontology%2DBased Integration for Relational Data.

An internet routing forensics framework for discovering rules of abnormal BGP events.

Ontology Translation on the Semantic Web.
Abstract. Ontologies are a crucial tool for formally specifying the vocabulary and relationship of concepts used on the Semantic Web. In order to share information, agents that use different vocabularies must be able to translate data from one ontological framework to another. Ontology translation is required when translating datasets, generating ontology extensions, and querying through different ontologies. OntoMerge, an online system for ontology merging and automated reasoning, can implement ontology translation with inputs and outputs in OWL or other web languages. The merge of two related ontologies is obtained by taking the union of the concepts and the axioms defining them, and then adding bridging axioms that relate their concepts. The resulting merged ontology then serves as an inferential medium within which translation can occur. Our internal representation, Web-PDDL, is a strong typed first-order logic language for web application. Using a uniform notation for all problems allows us to factor out syntactic and semantic translation problems, and focus on the latter. Syntactic translation is done by an automatic translator between Web-PDDL and OWL or other web languages. Semantic translation is implemented using an inference engine (OntoEngine) which processes assertions and queries in Web-PDDL syntax, running in either a data-driven (forward chaining) or demand-driven (backward chaining) way. 1
Ontology Translation on the Semantic Web.
Abstract. Ontologies are a crucial tool for formally specifying the vocabulary and relationship of concepts used on the Semantic Web. In order to share information, agents that use different vocabularies must be able to translate data from one ontological framework to another. Ontology translation is required when translating datasets, generating ontology extensions, and querying through different ontologies. OntoMerge, an online system for ontology merging and automated reasoning, can implement ontology translation with inputs and outputs in OWL or other web languages. The merge of two related ontologies is obtained by taking the union of the concepts and the axioms defining them, and then adding bridging axioms that relate their concepts. The resulting merged ontology then serves as an inferential medium within which translation can occur. Our internal representation, Web-PDDL, is a strong typed first-order logic language for web application. Using a uniform notation for all problems allows us to factor out syntactic and semantic translation problems, and focus on the latter. Syntactic translation is done by an automatic translator between Web-PDDL and OWL or other web languages. Semantic translation is implemented using an inference engine (OntoEngine) which processes assertions and queries in Web-PDDL syntax, running in either a data-driven (forward chaining) or demand-driven (backward chaining) way. 1
Representing Disjunction and Quantifiers in RDF.
Abstract. The advantage ofthe RDF/DAML+OIL family oflanguages over ordinary XML is that it is topic-neutral and composable. However, its expressivity is severely limited. This limitation is well known, and the usual remedy is reification, in which RDF is used to describe formulas in a richer language. We propose a method for encoding typed predicate calculus using reification, which handles bound variables cleanly and causes the size to increase by only a constant multiple. The method generalizes to virtually any system, a claim which we illustrate by describing our program, PDDAML, which encodes domain specifications in PDDL using our technique. We argue that reification, while logically suspect, is in practice benign because any algorithm capable ofdoing inferences using logical notations can be easily extended to “unreify ” those notations as needed. We also argue that the ability to represent predicate calculus on the semantic web is crucial. 1
